Eventual Convexity of Chance Constrained Feasible Sets
نویسندگان
چکیده
In decision making problems where uncertainty plays a key role and decisions have to be taken prior to observing uncertainty, chance constraints are a strong modelling tool for defining safety of decisions. These constraints request that a random inequality system depending on a decision vector has to be satisfied with a high probability. The characteristics of the feasible set of such chance constraints depend on the constraint mapping of the random inequality system, the underlying law of uncertainty and the probability level. One characteristic of particular interest is convexity. Convexity can be shown under fairly general conditions on the underlying law of uncertainty and on the constraint mapping, regardless of the probability-level. In some situations convexity can only be shown when the probability-level is high enough. This is defined as eventual convexity. In this paper we will investigate further how eventual convexity can be assured for specially structured chance constraints involving Copulae. The Copulae have to exhibit generalized concavity properties. In particular we will extend recent results and exhibit a clear link between the generalized concavity properties of the various mappings involved in the chance constraint for the result to hold. Various examples show the strength of the provided generalization.
منابع مشابه
SOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING
Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...
متن کاملConvexity of chance constraints with dependent random variables: the use of copulae
We consider the convexity of chance constraints with random righthand side. While this issue is well understood (thanks to Prékopa’s Theorem) if the mapping operating on the decision vector is componentwise concave, things become more delicate when relaxing the concavity property. In an earlier paper, the significantly weaker r-concavity concept could be exploited, in order to derive eventual c...
متن کاملConvexity of chance constrained programming problems with respect to a new generalized concavity notion
In this paper, convexity of chance constrained problems have been investigated. A new generalization of convexity concept, named h-concavity, has been introduced and it has been shown that this new concept is the generalization of the α-concavity. Then, using the new concept, some of the previous results obtained by Shapiro et al. [in Lecture Notes on Stochastic Programming Modeling and Theory,...
متن کاملSolution of Grey Chance Constrained Programming and Convexity of its Feasible Set
If there are grey variables in the constraint conditions in uncertain programming, the programming is called grey chance constrained programming. In this paper we provide the concept of grey chance constrained programming. When the whitenization weight functions of grey variables are known and the distribution functions are constructed, we studied the certainty equivalence solution of grey chan...
متن کاملChance-constrained programming with fuzzy stochastic coefficients
We consider fuzzy stochastic programming problems with a crisp objective function and linear constraints whose coefficients are fuzzy random variables, in particular of type L-R. To solve this type of problems, we formulate deterministic counterparts of chance-constrained programming with fuzzy stochastic coefficients, by combining constraints on probability of satisfying constraints, as well a...
متن کامل